Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem

نویسندگان

  • Igor Vasil'ev
  • Pasquale Avella
  • Maurizio Boccia
  • Carlo Mannino
چکیده

The problem of sequencing and scheduling airplanes landing and taking off on a runway is under consideration. We propose a new family of valid inequalities which are obtained from the study of the single machine scheduling problem polytope.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...

متن کامل

MULTI-OBJECTIVE MATHEMATICAL MODELING OF AIRCRAFT LANDING PROBLEM ON A RUNWAY IN STATIC MODE, SCHEDULING AND SEQUENCE DETERMINATION USING NSGA-II

Runway length is usually a critical point in an airport system so, a great interest has been created for optimal use of this runway length. The most important factors in modeling of aircraft landing problem are time and cost while, the costs imposed on the system because of moving away from target times have different performances in terms of impact. In this paper, firstly, aircraft landing pro...

متن کامل

Valid inequalities for a time-indexed formulation

We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities.

متن کامل

Determination of the Aircraft Landing Sequence by Two Meta-Heuristic Algorithms

Due to an anticipated increase in air traffic during the next decade, air traffic control in busy airports is one of the main challenges confronting the controllers in the near future. Since the runway is often a bottleneck in an airport system, there is a great interest in optimizing the use of the runway. The most important factors in aircraft landing modeling are time and cost. For this reas...

متن کامل

Scheduling Aircraft Landings - The Static Case

In this paper we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and separation criteria between the landing of a plane, and the landing of all successive planes, are respected. We present a mixed-integer zero-one formulation of the problem for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016